Reconfiguring Independent Sets in Claw-Free Graphs
نویسندگان
چکیده
We present a polynomial-time algorithm that given two independent sets in a claw-free graph G decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex v from the current independent set S in the sequence and to add a new vertex w (not in S) such that the set S−v+w is independent
منابع مشابه
Bounds on the Number of Vertex Independent Sets in a Graph
We consider the number of vertex independent sets i(G). In general, the problem of determining the value of i(G) is NP -complete. We present several upper and lower bounds for i(G) in terms of order, size or independence number. We obtain improved bounds for i(G) on restricted graph classes such as the bipartite graphs, unicyclic graphs, regular graphs and claw-free graphs.
متن کاملApproximating independence polynomials of claw-free graphs
Matchings in graphs correspond to independent sets in the corresponding line graphs. Line graphs are an important subclass of claw-free graphs. Hence studying independence polynomials of claw-free graphs is a natural extension of studying matching polynomials of graphs. We extend a result of Bayati et.al. showing a fully polynomial time approximation scheme (FPTAS) for computing the independenc...
متن کاملCounting Independent Sets in Claw-Free Graphs
Although many of the counting problems (e.g. counting independent sets or matchings in a graph) are known to be #P-Complete (see Vadhan [3]), a remarkable progress has been done in designing exponential time algorithms solving them. Dahllöf, Jonsson, Wahlström [2] constructed algorithms that count maximum weight models of 2-SAT formulas in time O∗(1.2561n). This bound bound was later improved t...
متن کامل2-factors and Independent Sets on Claw-free Graphs
In this paper, we show that if G is an l-connected claw-free graph with minimum degree at least three and l ∈ {2, 3}, then for any maximum independent set S, there exists a 2-factor in which each cycle contains at least l − 1 vertices in S.
متن کاملMaximum weight independent set for ℓclaw-free graphs in polynomial time
The MaximumWeight Independent Set (MWIS) problem is a well-known NPhard problem. A popular way to study MWIS is to detect graph classes for which MWIS can be solved in polynomial time, with particular reference to hereditary graph classes, i.e., defined by a hereditary graph property or equivalently by forbidding one or more induced subgraphs. For graphs G1, G2, G1 + G2 denotes the disjoint uni...
متن کامل